Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
a(b(x)) |
→ b(a(x)) |
| 2: |
|
a(c(x)) |
→ x |
|
There is one dependency pair:
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
There are no usable rules.
By taking the AF π with
π(A) = 1 together with
the lexicographic path order with
empty precedence,
rule 3
is strictly decreasing.
Hence the TRS is terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006